Compare-by-Hash: A Reasoned Analysis
نویسنده
چکیده
Compare-by-hash is the now-common practice used by systems designers who assume that when the digest of a cryptographic hash function is equal on two distinct files, then those files are identical. This approach has been used in both real projects and in research efforts (for example rysnc [16] and LBFS [12]). A recent paper by Henson criticized this practice [8]. The present paper revisits the topic from an advocate’s standpoint: we claim that compare-by-hash is completely reasonable, and we offer various arguments in support of this viewpoint in addition to addressing concerns raised by Henson.
منابع مشابه
Modification of Reasoned Action Theory and comparison with the original version by path analysis for substance abuse prevention among adolescents
Introduction: Objective of present study was assessing the competence of self efficacy to development of theory of Reasoned Action (TRA) and comparison with original version by path analysis for substance abuse prevention among adolescents. Methods: In this analytic study, 433 randomly selected adolescents (range of age 15–19) from Tehran participated in study. The study design was based ...
متن کاملSecurity Analysis of a Hash-Based Secret Sharing Scheme
Secret sharing schemes perform an important role in protecting se-cret by sharing it among multiple participants. In 1979, (t; n) threshold secret sharing schemes were proposed by Shamir and Blakley independently. In a (t; n) threshold secret sharing scheme a secret can be shared among n partic-ipants such that t or more participants can reconstruct the secret, but it can not be reconstructed b...
متن کاملValidation study of the extended theory of reasoned action questionnaire for drug abuse prevention in adolescents
The aim of this study was to design and assess the validity and reliability of the theory of reasoned action extended version questionnaire for drug abuse avoidance in Iranian male adolescents. Validity and reliability of a measure consisting of TRA and self efficacy construct for substance abuse avoidance was assessed by scientific methods. Cross-sectional data was collected via self-admini...
متن کاملAn Improved Hash Function Based on the Tillich-Zémor Hash Function
Using the idea behind the Tillich-Zémor hash function, we propose a new hash function. Our hash function is parallelizable and its collision resistance is implied by a hardness assumption on a mathematical problem. Also, it is secure against the known attacks. It is the most secure variant of the Tillich-Zémor hash function until now.
متن کاملGuidelines for Using Compare-by-hash
Recently, a new technique called compare-by-hash has become popular. Compare-by-hash is a method of content-based addressing in which data is identified only by the cryptographic hash of its contents. Hash collisions are ignored, with the justification that they occur less often than many kinds of hardware errors. Compare-by-hash is a powerful, versatile tool in the software architect’s bag of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006